Optimal Search with Inadmissible Heuristics
نویسندگان
چکیده
Considering cost-optimal heuristic search, we introduce the notion of global admissibility of a heuristic, a property weaker than standard admissibility, yet sufficient for guaranteeing solution optimality within forward search. We describe a concrete approach for creating globally admissible heuristics for domain independent planning; it is based on exploiting information gradually gathered by the search via a new form of reasoning about what we call existential optimalplan landmarks. We evaluate our approach on some state-ofthe-art heuristic search tools for cost-optimal planning, and discuss the results of this evaluation.
منابع مشابه
Improved Multi-Heuristic A*
Recently, several researchers have brought forth the benefits of searching with multiple (and possibly inadmissible) heuristics, arguing how different heuristics could be independently useful in different parts of the state space. However, algorithms that use inadmissible heuristics in the traditional best-first sense, such as the recently developed MultiHeuristic A* (MHA*), are subject to a cr...
متن کاملLearning Inadmissible Heuristics During Search
Suboptimal search algorithms offer shorter solving times by sacrificing guaranteed solution optimality. While optimal search algorithms like A* and IDA* require admissible heuristics, suboptimal search algorithms need not constrain their guidance in this way. Previous work has explored using off-line training to transform admissible heuristics into more effective inadmissible ones. In this pape...
متن کاملImproving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA
Admissible heuristics are essential for optimal planning in the context of search algorithms like A*, and they can also be used in the context of suboptimal planning in order to find quality-bounded solutions. In satisfacing planning, on the other hand, admissible heuristics are not exploited by the best-first search algorithms of existing planners even when a time window is available for impro...
متن کاملTowards Real-Time Search with Inadmissible Heuristics
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning ability (through repeated trials). In both respects, the use of inadmissible (and hence inconsistent) heuristic functions bring some merits such as improved performance, but there is no theory yet that well explains when ...
متن کاملLearning to Search More Efficiently from Experience: A Multi-Heuristic Approach
Learning from experience can significantly improve the performance of search based planners, especially for challenging problems like high-dimensional planning. Experience Graph (E-Graph) is a recently developed framework that encodes experiences, obtained from solving instances in the past, into a single bounded-admissible heuristic, and uses it to guide the search. While the E-Graph approach ...
متن کامل